Using Genetic Algorithms for Navigation Planning in Dynamic Environments
نویسندگان
چکیده
منابع مشابه
Dynamic route planning for car navigation systems using virus genetic algorithms
This paper describes a practical dynamic route planning method using real road maps in a wide area. The maps include traffic signals, road classes, and the number of lanes. The proposed solution is using a genetic algorithm adopting viral infection. The method is to use viruses as domain specific knowledge. A part of an arterial road is regarded as a virus. A population of viruses is generated ...
متن کاملPlanning approaches to constraint-aware navigation in dynamic environments
Path planning is a fundamental problem in many areas, ranging from robotics and artificial intelligence to computer graphics and animation. Although there is extensive literature for computing optimal, collision-free paths, there is relatively little work that explores the satisfaction of spatial constraints between objects and agents at the global navigation layer. This paper presents a planni...
متن کاملAdapting Genetic Algorithms for Combinatorial Optimization Problems in Dynamic Environments
Combinatorial optimization problems (COPs) have a wide range of applications in engineering, operation research, and social sciences. Moreover, as real-time information and communication systems become increasingly available and the processing of real-time data becomes increasingly affordable, new versions of highly dynamic real-world applications are created. In such applications, information ...
متن کاملAssociative Memory Scheme for Genetic Algorithms in Dynamic Environments
In recent years dynamic optimization problems have attracted a growing interest from the community of genetic algorithms with several approaches developed to address these problems, of which the memory scheme is a major one. In this paper an associative memory scheme is proposed for genetic algorithms to enhance their performance in dynamic environments. In this memory scheme, the environmental...
متن کاملA Hybrid Immigrants Scheme for Genetic Algorithms in Dynamic Environments
Dynamic optimization problems are a kind of optimization problems that involve changes over time. They pose a serious challenge to traditional optimization methods as well as conventional genetic algorithms since the goal is no longer to search for the optimal solution(s) of a fixed problem but to track the moving optimum over time. Dynamic optimization problems have attracted a growing interes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Computational Intelligence and Soft Computing
سال: 2012
ISSN: 1687-9724,1687-9732
DOI: 10.1155/2012/560184